Non-normal numbers with respect to Markov partitions
نویسندگان
چکیده
منابع مشابه
Non-normal numbers with respect to Markov partitions
We call a real number normal if for any block of digits the asymptotic frequency of this block in the N -adic expansion equals the expected one. In the present paper we consider non-normal numbers and, in particular, essentially and extremely non-normal numbers. We call a real number essentially non-normal if for each single digit there exists no asymptotic frequency of its occurrence. Furtherm...
متن کاملa comparison of teachers and supervisors, with respect to teacher efficacy and reflection
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
15 صفحه اولDirichlet distribution through neutralities with respect to two partitions
AMS 2010 subject classifications: 62H05 62E10 39B22 Keywords: Neutrality with respect to partition Dirichlet distribution Method of moments Characterization a b s t r a c t Different concepts of neutrality have been studied in the literature in context of independence properties of vectors of random probabilities, in particular, for Dirichlet random vectors. Some neutrality conditions led to ch...
متن کاملTypicality of normal numbers with respect to the Cantor series expansion
Fix a sequence of integers Q = {qn}n=1 such that qn is greater than or equal to 2 for all n. In this paper, we improve upon results by J. Galambos and F. Schweiger showing that almost every (in the sense of Lebesgue measure) real number in [0, 1) is Q-normal with respect to the Q-Cantor series expansion for sequences Q that satisfy a certain condition. We also provide asymptotics describing the...
متن کاملComputing Multiplicative Zagreb Indices with Respect to Chromatic and Clique Numbers
The chromatic number of a graph G, denoted by χ(G), is the minimum number of colors such that G can be colored with these colors in such a way that no two adjacent vertices have the same color. A clique in a graph is a set of mutually adjacent vertices. The maximum size of a clique in a graph G is called the clique number of G. The Turán graph Tn(k) is a complete k-partite graph whose partition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Continuous Dynamical Systems
سال: 2013
ISSN: 1078-0947
DOI: 10.3934/dcds.2014.34.663